Greedy bisection generates optimally adapted triangulations
نویسندگان
چکیده
منابع مشابه
Greedy bisection generates optimally adapted triangulations
We study the properties of a simple greedy algorithm introduced in [8] for the generation of dataadapted anisotropic triangulations. Given a function f , the algorithm produces nested triangulations TN and corresponding piecewise polynomial approximations fN of f . The refinement procedure picks the triangle which maximizes the local L approximation error, and bisects it in a direction which is...
متن کاملQuasi - Greedy Triangulations Approximating
This paper settles the following two longstanding open problems: 1. What is the worst-case approximation ratio between the greedy and the minimum weight triangulation? 2. Is there a polynomial time algorithm that always produces a triangulation whose length is within a constant factor from the minimum? The answer to the rst question is that the known (p n) lower bound is tight. The second quest...
متن کاملBisection-Based Triangulations of Nested Hypercubic Meshes
Hierarchical spatial decompositions play a fundamental role in many disparate areas of scientific and mathematical computing since they enable adaptive sampling of large problem domains. Although the use of quadtrees, octrees, and their higher dimensional analogues is ubiquitous, these structures generate meshes with cracks, which can lead to discontinuities in functions defined on their domain...
متن کاملLocally Adapted Tetrahedral Meshes Using Bisection
We present an algorithm for the construction of locally adapted conformal tetrahedral meshes. The algorithm is based on bisection of tetrahedra. A new data structure is introduced, which simplifies both the selection of the refinement edge of a tetrahedron and the recursive refinement to conformity of a mesh once some tetrahedra have been bisected. We prove that repeated application of the algo...
متن کاملOptimally Streaming Greedy Regular Expression Parsing
We study the problem of streaming regular expression parsing: Given a regular expression and an input stream of symbols, how to output a serialized syntax tree representation as an output stream during input stream processing. We show that optimally streaming regular expression parsing, outputting bits of the output as early as is semantically possible for any regular expression of size m and a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 2011
ISSN: 0025-5718,1088-6842
DOI: 10.1090/s0025-5718-2011-02459-2